top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Advances in Proof-Theoretic Semantics / / edited by Thomas Piecha, Peter Schroeder-Heister
Advances in Proof-Theoretic Semantics / / edited by Thomas Piecha, Peter Schroeder-Heister
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (vi, 283 pages) : digital file(s)
Disciplina 160
Collana Trends in Logic, Studia Logica Library
Soggetto topico Logic
Mathematical logic
Mathematical Logic and Foundations
Mathematical Logic and Formal Languages
ISBN 3-319-22686-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Chapter 1. Introduction; Thomas Piecha & Peter-Schroeder-Heister -- Chapter 2. On Brouwer-Heyting-Kolmogorov provability semantics; Sergei N. Artëmov -- Chapter 3. Two Ways of General Proof Theory; Kosta Došen -- Chapter 4. Generalised elimination rules; Roy Dyckhoff -- Chapter 5. On the proof theoretic foundations of set theory; Lars Hallnäs -- Chapter 6. The choice of semantics as a methodological question; Wilfrid Hodges -- Chapter 7. The mode of presentation; Reinhard Kahle -- Chapter 8. Remarks on relations between Gentzen and Heyting inspired PTS; Dag Prawitz -- Chapter 9. Unification of logics by reflection; Giovanni Sambin -- Chapter 10. BHK and Brouwer's Theory of the Creative Subject; Göran Sundholm -- Chapter 11. Compositional semantics for predicate logic: Eliminating bound variables from formulas and deductions; William W. Tait -- Chapter 12. Intuitionism, the Paradox of Knowability and Empirical Negation; Gabriele Usberti -- Chapter 13. Explicit composition and its application in normalization proofs; Jan von Plato -- Chapter 14. A two-sorted typed lambda-calculus; Heinrich Wansing -- Chapter 15. Kreisel's second clause and the Theory of Constructions; Walter Dean & Hidenori Kurokawa -- Chapter 16. On Paradoxes in Proof-Theoretic Semantics; Yoshihiro Maruyama.
Record Nr. UNINA-9910137163703321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Extensions of Logic Programming [[electronic resource] ] : 5th International Workshop, ELP '96, Leipzig, Germany, March 28 - 30, 1996. Proceedings. / / edited by Roy Dyckhoff, Heinrich Herre, Peter Schroeder-Heister
Extensions of Logic Programming [[electronic resource] ] : 5th International Workshop, ELP '96, Leipzig, Germany, March 28 - 30, 1996. Proceedings. / / edited by Roy Dyckhoff, Heinrich Herre, Peter Schroeder-Heister
Edizione [1st ed. 1996.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
Descrizione fisica 1 online resource (X, 322 p.)
Disciplina 005.1/1
Collana Lecture Notes in Artificial Intelligence
Soggetto topico Programming languages (Electronic computers)
Architecture, Computer
Artificial intelligence
Computer programming
Mathematical logic
Programming Languages, Compilers, Interpreters
Computer System Implementation
Artificial Intelligence
Programming Techniques
Mathematical Logic and Formal Languages
ISBN 3-540-49751-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Semantics of constraint logic programs with bounded quantifiers -- Translating a modal language with embedded implication into Horn clause logic -- Pruning the search space of logic programs -- A significant extension of logic programming by adapting model building rules -- Efficient resource management for linear logic proof search -- A logic language based on GAMMA-like multiset rewriting -- Default negated conclusions: Why not? -- Handling equality in logic programming via basic folding -- An abstract machine for reasoning about situations, actions, and causality -- On the computational complexity of propositional logic programs with nested implications -- Proof-theory for extensions of Logic Programming -- A fibrational semantics for logic programs -- Higher Order Babel: Language and implementation -- A new framework for declarative programming: Categorical perspectives -- Extending constructive negation for partial functions in lazy functional-logic languages -- Super logic programs and negation as belief -- Total correctness of logic programs: A formal approach -- A declarative semantics for the Prolog cut operator -- A definitional approach to functional logic programming -- Soundness and completeness of non-classical extended SLD-resolution -- Some postulates for nonmonotonic theory revision applied to logic programming.
Record Nr. UNISA-996465578903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Extensions of Logic Programming [[electronic resource] ] : Second International Workshop, ELP '91, Stockholm, Sweden, January 27-29, 1991. Proceedings / / edited by Lars-Henrik Eriksson, Lars Hallnäs, Peter Schroeder-Heister
Extensions of Logic Programming [[electronic resource] ] : Second International Workshop, ELP '91, Stockholm, Sweden, January 27-29, 1991. Proceedings / / edited by Lars-Henrik Eriksson, Lars Hallnäs, Peter Schroeder-Heister
Edizione [1st ed. 1992.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992
Descrizione fisica 1 online resource (VIII, 376 p.)
Disciplina 005.1
Collana Lecture Notes in Artificial Intelligence
Soggetto topico Software engineering
Artificial intelligence
Computer programming
Software Engineering/Programming and Operating Systems
Artificial Intelligence
Programming Techniques
ISBN 3-540-47114-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Methodology and programming techniques in GCLA II -- Extended logic-plus-functional Programming -- Open logic theories -- A finitary version of the calculus of partial inductive definitions -- A logic programming approach to implementing higher-Order term rewriting -- An overview of the Andorra Kernel Language -- Logical and computational invariants of programs -- Implementing ?-calculus reduction strategies in extended logic programming languages -- Terminological reasoning and partial inductive definitions -- GCLA II A definitional approach to control -- Natural semantics and some of its meta-theory in Elf -- The near-Horn approach to disjunctive logic programming.
Record Nr. UNISA-996465734303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Extensions of Logic Programming [[electronic resource] ] : International Workshop, Tübingen, FRG, December 8-10, 1989. Proceedings / / edited by Peter Schroeder-Heister
Extensions of Logic Programming [[electronic resource] ] : International Workshop, Tübingen, FRG, December 8-10, 1989. Proceedings / / edited by Peter Schroeder-Heister
Edizione [1st ed. 1991.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
Descrizione fisica 1 online resource (X, 366 p.)
Disciplina 006.3
Collana Lecture Notes in Artificial Intelligence
Soggetto topico Artificial intelligence
Computer logic
Artificial Intelligence
Logics and Meanings of Programs
ISBN 3-540-46879-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Logic programming with sequent systems -- Predicates as parameters in logic programming -- A survey of GCLA: A definitional approach to logic programming -- Some applications of Gentzen's proof theory in automated deduction -- A logic program for transforming sequent proofs to natural deduction proofs -- Modal provability foundations for negation by failure -- Extensions to logic programming motivated by the construction of a generic theorem prover -- A decision procedure for propositional N-Prolog -- A logic programming language with lambda-abstraction, function variables, and simple unification -- Logic programming, functional programming, and inductive definitions -- Logic programming with strong negation -- Hypothetical reasoning and definitional reflection in logic programming -- Non-monotonicity and conditionals in dialogue logic.
Record Nr. UNISA-996465554603316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
The Logical Writings of Karl Popper [[electronic resource] /] / edited by David Binder, Thomas Piecha, Peter Schroeder-Heister
The Logical Writings of Karl Popper [[electronic resource] /] / edited by David Binder, Thomas Piecha, Peter Schroeder-Heister
Autore Binder David
Edizione [1st ed. 2022.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Descrizione fisica 1 online resource (558 pages)
Disciplina 160
Altri autori (Persone) PiechaThomas
Schroeder-HeisterPeter
Collana Trends in Logic, Studia Logica Library
Soggetto topico Logic
Mathematical logic
Language and languages - Style
Mathematical Logic and Foundations
Stylistics
Lògica
Soggetto genere / forma Llibres electrònics
ISBN 3-030-94926-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part I: Articles -- Chapter 1. Introduction to Popper’s Articles on Logic (David Binder, Thomas Piecha, and Peter Schroeder-Heister) -- Chapter 2. Are Contradictions Embracing? (1943) (Karl R. Popper) -- Chapter 3. Logic without Assumptions (1947) (Karl R. Popper) -- Chapter 4. New Foundations for Logic (1947) (Karl R. Popper) -- Chapter 5. Functional Logic without Axioms or Primitive Rules of Inference (1947)(Karl R. Popper) -- Chapter 6. On the Theory of Deduction, Part I. Derivation and its Generalizations (1948) (Karl R. Popper) -- Chapter 7. On the Theory of Deduction, Part II. The Definitions of Classical and Intuitionist Negation (1948) (Karl R. Popper) -- Chapter 8. The Trivialization of Mathematical Logic (1949) (Karl R. Popper) -- Chapter 9. A Note on Tarski’s Definition of Truth (1955) (Karl R. Popper) -- Chapter 10. On a Proposed Solution of the Paradox of the Liar (1955) (Karl R. Popper) -- Chapter 11. On Subjunctive Conditionals with Impossible Antecedents (1959) (Karl R. Popper) -- Chapter 12. Lejewski’s Axiomatization of My Theory of Deducibility (1974) (Karl R. Popper) -- Chapter 13. Reviews of Popper’s Articles on Logic (Wilhelm Ackermann et.al) -- Part II: Manuscripts -- Chapter 14. Introduction to Popper’s Manuscripts on Logic (David Binder, Thomas Piecha, and Peter Schroeder-Heister) -- Chapter 15. On Systems of Rules of Inference (Karl R. Popper and Paul Bernays) -- Chapter 16. A General Theory of Inference (Karl R. Popper) -- Chapter 17. On the Logic of Negation (Karl R. Popper) -- Chapter 18. A Note on the Classical Conditional (Karl R. Popper) -- Part III: Correspondence -- Chapter 19. Introduction to Popper’s Correspondence on Logic (David Binder, Thomas Piecha, and Peter Schroeder-Heister) -- Chapter 20. Popper’s Correspondence with Paul Bernays (Karl R. Popper and Paul Bernays) -- Chapter 21. Popper’s Correspondence with Luitzen Egbertus Jan Brouwer (Karl R. Popper and Luitzen E. J. Brouwer) -- Chapter 22. Popper’s Correspondence with Rudolf Carnap (Karl R. Popper and Rudolf Carnap) -- Chapter 23. Popper’s Correspondence with Alonzo Church (Karl R. Popper and Alonzo Church) -- Chapter 24. Popper’s Correspondence with Kalman Joseph Cohen (Karl R. Popper and Kalman J. Cohen) -- Chapter 25. Popper’s Correspondence with Henry George Forder (Karl R. Popper and Henry George Forder) -- Chapter 26. Popper’s Correspondence with Harold Jeffreys (Karl R. Popper and Harold Jeffreys) -- Chapter 27. Popper’s Correspondence with Stephen Cole Kleene (Karl R. Popper and Stephen C. Kleene) -- Chapter 28. Popper’s Correspondence with William Calvert Kneale (Karl R. Popper and William C. Kneale) -- Chapter 29. Popper’s Correspondence with Willard Van Orman Quine (Karl R. Popper and Willard V. O. Quine) -- Chapter 30. Popper’s Correspondence with Heinrich Scholz (Karl R. Popper and Heinrich Scholz) -- Chapter 31. Popper’s Correspondence with Peter Schroeder-Heister (Karl R. Popper and Peter Schroeder-Heister) -- Concordances -- Bibliography -- Index.
Record Nr. UNISA-996483153503316
Binder David  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
The Logical Writings of Karl Popper [[electronic resource] /] / edited by David Binder, Thomas Piecha, Peter Schroeder-Heister
The Logical Writings of Karl Popper [[electronic resource] /] / edited by David Binder, Thomas Piecha, Peter Schroeder-Heister
Autore Binder David
Edizione [1st ed. 2022.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Descrizione fisica 1 online resource (558 pages)
Disciplina 160
Altri autori (Persone) PiechaThomas
Schroeder-HeisterPeter
Collana Trends in Logic, Studia Logica Library
Soggetto topico Logic
Mathematical logic
Language and languages - Style
Mathematical Logic and Foundations
Stylistics
Lògica
Soggetto genere / forma Llibres electrònics
ISBN 3-030-94926-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part I: Articles -- Chapter 1. Introduction to Popper’s Articles on Logic (David Binder, Thomas Piecha, and Peter Schroeder-Heister) -- Chapter 2. Are Contradictions Embracing? (1943) (Karl R. Popper) -- Chapter 3. Logic without Assumptions (1947) (Karl R. Popper) -- Chapter 4. New Foundations for Logic (1947) (Karl R. Popper) -- Chapter 5. Functional Logic without Axioms or Primitive Rules of Inference (1947)(Karl R. Popper) -- Chapter 6. On the Theory of Deduction, Part I. Derivation and its Generalizations (1948) (Karl R. Popper) -- Chapter 7. On the Theory of Deduction, Part II. The Definitions of Classical and Intuitionist Negation (1948) (Karl R. Popper) -- Chapter 8. The Trivialization of Mathematical Logic (1949) (Karl R. Popper) -- Chapter 9. A Note on Tarski’s Definition of Truth (1955) (Karl R. Popper) -- Chapter 10. On a Proposed Solution of the Paradox of the Liar (1955) (Karl R. Popper) -- Chapter 11. On Subjunctive Conditionals with Impossible Antecedents (1959) (Karl R. Popper) -- Chapter 12. Lejewski’s Axiomatization of My Theory of Deducibility (1974) (Karl R. Popper) -- Chapter 13. Reviews of Popper’s Articles on Logic (Wilhelm Ackermann et.al) -- Part II: Manuscripts -- Chapter 14. Introduction to Popper’s Manuscripts on Logic (David Binder, Thomas Piecha, and Peter Schroeder-Heister) -- Chapter 15. On Systems of Rules of Inference (Karl R. Popper and Paul Bernays) -- Chapter 16. A General Theory of Inference (Karl R. Popper) -- Chapter 17. On the Logic of Negation (Karl R. Popper) -- Chapter 18. A Note on the Classical Conditional (Karl R. Popper) -- Part III: Correspondence -- Chapter 19. Introduction to Popper’s Correspondence on Logic (David Binder, Thomas Piecha, and Peter Schroeder-Heister) -- Chapter 20. Popper’s Correspondence with Paul Bernays (Karl R. Popper and Paul Bernays) -- Chapter 21. Popper’s Correspondence with Luitzen Egbertus Jan Brouwer (Karl R. Popper and Luitzen E. J. Brouwer) -- Chapter 22. Popper’s Correspondence with Rudolf Carnap (Karl R. Popper and Rudolf Carnap) -- Chapter 23. Popper’s Correspondence with Alonzo Church (Karl R. Popper and Alonzo Church) -- Chapter 24. Popper’s Correspondence with Kalman Joseph Cohen (Karl R. Popper and Kalman J. Cohen) -- Chapter 25. Popper’s Correspondence with Henry George Forder (Karl R. Popper and Henry George Forder) -- Chapter 26. Popper’s Correspondence with Harold Jeffreys (Karl R. Popper and Harold Jeffreys) -- Chapter 27. Popper’s Correspondence with Stephen Cole Kleene (Karl R. Popper and Stephen C. Kleene) -- Chapter 28. Popper’s Correspondence with William Calvert Kneale (Karl R. Popper and William C. Kneale) -- Chapter 29. Popper’s Correspondence with Willard Van Orman Quine (Karl R. Popper and Willard V. O. Quine) -- Chapter 30. Popper’s Correspondence with Heinrich Scholz (Karl R. Popper and Heinrich Scholz) -- Chapter 31. Popper’s Correspondence with Peter Schroeder-Heister (Karl R. Popper and Peter Schroeder-Heister) -- Concordances -- Bibliography -- Index.
Record Nr. UNINA-9910583593903321
Binder David  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proof Theory in Computer Science [[electronic resource] ] : International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings / / edited by Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk
Proof Theory in Computer Science [[electronic resource] ] : International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings / / edited by Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (X, 246 p.)
Disciplina 004/.01/5113
Collana Lecture Notes in Computer Science
Soggetto topico Programming languages (Electronic computers)
Mathematical logic
Artificial intelligence
Computer logic
Algorithms
Programming Languages, Compilers, Interpreters
Mathematical Logic and Foundations
Artificial Intelligence
Mathematical Logic and Formal Languages
Logics and Meanings of Programs
Algorithm Analysis and Problem Complexity
ISBN 3-540-45504-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Linear Ramified Higher Type Recursion and Parallel Complexity -- Reflective ?-Calculus -- A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity -- Comparing the Complexity of Cut-Elimination Methods -- Program Extraction from Gentzen’s Proof of Transfinite Induction up to ?0 -- Coherent Bicartesian and Sesquicartesian Categories -- Indexed Induction-Recursion -- Modeling Meta-logical Features in a Calculus with Frozen Variables -- Proof Theory and Post-turing Analysis -- Interpolation for Natural Deduction with Generalized Eliminations -- Implicit Characterizations of Pspace -- Iterate logic -- Constructive Foundations for Featherweight Java.
Record Nr. UNINA-9910143621603321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proof Theory in Computer Science [[electronic resource] ] : International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings / / edited by Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk
Proof Theory in Computer Science [[electronic resource] ] : International Seminar, PTCS 2001 Dagstuhl Castle, Germany, October 7-12, 2001. Proceedings / / edited by Reinhard Kahle, Peter Schroeder-Heister, Robert Stärk
Edizione [1st ed. 2001.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica 1 online resource (X, 246 p.)
Disciplina 004/.01/5113
Collana Lecture Notes in Computer Science
Soggetto topico Programming languages (Electronic computers)
Mathematical logic
Artificial intelligence
Computer logic
Algorithms
Programming Languages, Compilers, Interpreters
Mathematical Logic and Foundations
Artificial Intelligence
Mathematical Logic and Formal Languages
Logics and Meanings of Programs
Algorithm Analysis and Problem Complexity
ISBN 3-540-45504-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Linear Ramified Higher Type Recursion and Parallel Complexity -- Reflective ?-Calculus -- A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity -- Comparing the Complexity of Cut-Elimination Methods -- Program Extraction from Gentzen’s Proof of Transfinite Induction up to ?0 -- Coherent Bicartesian and Sesquicartesian Categories -- Indexed Induction-Recursion -- Modeling Meta-logical Features in a Calculus with Frozen Variables -- Proof Theory and Post-turing Analysis -- Interpolation for Natural Deduction with Generalized Eliminations -- Implicit Characterizations of Pspace -- Iterate logic -- Constructive Foundations for Featherweight Java.
Record Nr. UNISA-996465826903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui